Nonlinear Chebychev approximation by vector-norms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ergodicity Coefficients Defined by Vector Norms

Ergodicity coefficients for stochastic matrices determine inclusion regions for subdominant eigenvalues; estimate the sensitivity of the stationary distribution to changes in the matrix; and bound the convergence rate of methods for computing the stationary distribution. We survey results for ergodicity coefficients that are defined by p-norms, for stochastic matrices as well as for general rea...

متن کامل

Sparse Nonlinear Support Vector Machines via Stochastic Approximation

Nonlinear support vector machines (SVMs) are more broadly useful than linear SVMs, as they can find more accurate predictors when the data under consideration have curved intrinsic category boundaries. Nonlinear SVM formulations based on kernels are, however, often much more expensive and data-intensive to solve than linear SVMs, and the resulting classifiers can be expensive to apply. This pap...

متن کامل

Solving Nonlinear Multicommodity Flow Problems by the Proximal Chebychev Center Cutting Plane Algorithm

The recent algorithm proposed in [15] (called pcpa) for convex nonsmooth optimization, is specialized for applications in telecommunications on some nonlinear multicommodity flows problems. In this context, the objective function is additive and this property could be exploited for a better performance.

متن کامل

All-Norms and All-L_p-Norms Approximation Algorithms

In many optimization problems, a solution can be viewed as ascribing a “cost” to each client, and the goal is to optimize some aggregation of the per-client costs. We often optimize some Lp-norm (or some other symmetric convex function or norm) of the vector of costs—though different applications may suggest different norms to use. Ideally, we could obtain a solution that optimizes several norm...

متن کامل

Vector diffraction analysis by discrete-dipole approximation.

The discrete-dipole approximation is applied to vector diffraction analysis in a system with large-numerical-aperture (NA) optics and subwavelength targets. Distributions of light diffracted by subwavelength dielectric targets are calculated in a solid angle that corresponds to a NA of 0.9, and their dependence on incident polarization, target shape, and target size is studied. Electric field d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1969

ISSN: 0021-9045

DOI: 10.1016/0021-9045(69)90032-x